An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq

Finding a minimum is an essential part of mathematical models, and it plays important role in some optimization problems. Durr Hoyer proposed quantum searching algorithm (DHA), with certain probability success, to achieve quadratic speed than classical ones. In this paper, we propose optimized sure-success probability, which utilizes Grover-Long implement the optimal exact searching, dynamic strategy reduce iterations our algorithm. Besides, optimize oracle circuit number gates by simplified rules. The performance evaluation including theoretical success rate computational complexity shows that has higher accuracy efficiency DHA Finally, simulation experiment based on Cirq performed verify its feasibility.